Combinatorics of Arc Diagrams, Ferrers Fillings, Young Tableaux and Lattice Paths

نویسنده

  • Marni Mishna
چکیده

Several recent works have explored the deep structure between arc diagrams, their nestings and crossings, and several other combinatorial objects including permutations, graphs, lattice paths, and walks in the Cartesian plane. This thesis inspects a range of related combinatorial objects that can be represented by arc diagrams, relationships between them, and their connection to nestings and crossings. We prove a direct connection between nestings in involutions and the shape of Young tableaux, clarify Knuth transformations in terms of Young tableaux, present a local transformation on arc diagrams of involutions that we term involutive transformations, and describe variants to the well-known RSK correspondence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Open Problem in the Combinatorics of Macdonald Polynomials

Although a combinatorial interpretation of Macdonald polynomials involving fillings of Ferrers diagrams of partitions has been known since 2004, a general combinatorial proof of a well-known symmetry property of these polynomials remains elusive. Our paper frames the problem and discusses an already-solved special case, that of one-dimensional (single-row or single-column) Ferrers diagrams, and...

متن کامل

Osculating Paths and Oscillating Tableaux

The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share...

متن کامل

Tree-like Tableaux

In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tree-like tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally o...

متن کامل

An injection from standard fillings to parking functions

The Hilbert series of the Garsia-Haiman module can be written as a generating function of standard fillings of Ferrers diagrams. It is conjectured by Haglund and Loehr that the Hilbert series of the diagonal harmonics can be written as a generating function of parking functions. In this paper we present a weight-preserving injection from standard fillings to parking functions for certain cases....

متن کامل

Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems

Bliem and Kousidis recently considered a family of random variables whose distributions are given by the generalized Galois numbers (after normalization). We give probabilistic interpretations of these random variables, using inversions in random words, random lattice paths and random Ferrers diagrams, and use these to give new proofs of limit theorems as well as some further limit results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009